Maximal Planar Subgraphs of Fixed Girth in Random Graphs
نویسنده
چکیده
In 1991, Bollobás and Frieze showed that the threshold for Gn,p to contain a spanning maximal planar subgraph is very close to p = n−1/3. In this paper, we compute similar threshold ranges for Gn,p to contain a maximal bipartite planar subgraph and for Gn,p to contain a maximal planar subgraph of fixed girth g.
منابع مشابه
Spanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کامل(5, 2)-Coloring of Sparse Graphs
We prove that every triangle-free graph whose subgraphs all have average degree less than 12/5 has a (5, 2)-coloring. This includes planar and projective-planar graphs with girth at least 12. Also, the degree result is sharp; we construct a minimal non(5, 2)-colorable triangle-free graph with 10 vertices that has average degree 12/5.
متن کاملBlocks in Constrained Random Graphs with Fixed Average Degree
This work is devoted to the study of typical properties of random graphs from classes with structural constraints, like for example planar graphs, with the additional restriction that the average degree is fixed. More precisely, within a general analytic framework, we provide sharp concentration results for the number of blocks (maximal biconnected subgraphs) in a random graph from the class in...
متن کاملOn Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...
متن کامل